# -*- coding: UTF-8 -*-
from typing import List
from leetcode_helper import TestcaseHelper, SolutionBase


class Solution(SolutionBase):
    # 解题的方法，命名和Leetcode的保持一致即可
    def findAnagrams(self, s: str, p: str) -> List[int]:
        s_len, p_len = len(s), len(p)

        if s_len < p_len:
            return []

        s_count = [0] * 26
        p_count = [0] * 26

        ans = []

        for i in range(0, p_len):
            s_count[ord(s[i]) - 97] += 1
            p_count[ord(p[i]) - 97] += 1

        if s_count == p_count:
            ans.append(0)

        for i in range(1, s_len - p_len + 1):
            s_count[ord(s[i-1]) - 97] -= 1
            s_count[ord(s[i+p_len-1]) - 97] += 1

            if s_count == p_count:
                ans.append(i)

        return ans


if __name__ == '__main__':
    solution = Solution()

    # 按照leetcode的题目说明，将基本的test case填入
    # 每条case的最后一个元素是正确的结果，即期待的结果
    # 使用元组来保存输入的数据，期待的结果
    testcases = [
        ("abab", "ab", [0, 1, 2]),
        ("cbaebabacd", "abc", [0, 6])
    ]

    for case_item in testcases:
        # 获取测试用的case和期待的执行结果

        input1 = case_item[0]
        input2 = case_item[1]
        expect = case_item[len(case_item) - 1]

        # TODO: 调用对应方法，需要替换具体的方法
        exec_result = solution.findAnagrams(input1, input2)

        # 判断执行结果，输出提示信息
        check_result = solution.check_result(expect, exec_result)
        TestcaseHelper.print_case(check_result, case_item, exec_result)

